Trustable Relays for Anonymous Communication

نویسندگان

  • Carlos Aguilar Melchor
  • Yves Deswarte
چکیده

Current systems providing anonymous interactive communication [15, 22] are based on networks of anonymity-providing relays called MIXes. An important issue with such systems is that a MIX is able to betray its users, and thus it is necessary to use several MIXes sequentially for each communication, which distributes the trust among them. This increases the complexity of the protocols as well as the latency. On the other side, such distributed systems are resilient and scalable, and they provide good enough performance for web browsing. An ideal relay should be unable to betray its users (we will say in this case that the relay is trustable). In such a setting, using multiple relays to distribute trust is not necessary, which simplifies design and reduces costs. Superposed sending provides an approach to construct trustable relays, the DC-net relays. Straightforward usage of classic protocols leads to other approaches and recently we proposed a set of trustable relays, based on Private Information Retrieval protocols, that provide new alternatives. Independently of their practical applications, these relays are interesting from a theoretic point of view. In this paper, we present a survey that gathers the different trustable relays we have been able to identify and gives a unified view of their construction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Traffic Analysis Attacks and Defenses in Low Latency Anonymous Communication

Traffic Analysis Attacks and Defenses in Low Latency Anonymous Communication Sambuddho Chakravarty The recent public disclosure of mass surveillance of electronic communication, involving powerful government authorities, has drawn the public’s attention to issues regarding Internet privacy. For almost a decade now, there have been several research efforts towards designing and deploying open so...

متن کامل

Systems for Anonymous Communication

We present an overview of the field of anonymous communications, from its establishment in 1981 by David Chaum to today. Key systems are presented categorized according to their underlying principles: semitrusted relays, mix systems, remailers, robust & verifiable mixes, and onion routing systems. We include extended discussions of the threat models and usage models that different schemes provi...

متن کامل

A Survey of Anonymous Communication Channels

We present an overview of the field of anonymous communications, from its establishment in 1981 from David Chaum to today. Key systems are presented categorized according to their underlying principles: semi-trusted relays, mix systems, remailers, onion routing, and systems to provide robust mixing. We include extended discussions of the threat models and usage models that different schemes pro...

متن کامل

Key Management for Onion Routing in a True Peer to Peer Setting

Onion routing is a technique for anonymous and privacy preserving communication at the base of popular Internet anonymity tools such as Tor. In onion routing, traffic is relayed by a number of intermediary nodes (called relays) before it reaches the intended destination. To guarantee privacy and prevent tampering, each packet is encrypted multiple times in a layered manner, using the public key...

متن کامل

Re: Relay Reliability Reputation for Anonymity Systems

To conceal user identities, Tor, a popular anonymity system, forwards traffic through multiple relays. These relays, however, are often unreliable, leading to a degraded user experience. Worse yet, malicious relays may strategically introduce deliberate failures to increase their chance of compromising anonymity. In this paper we propose a reputation system that profiles the reliability of rela...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Trans. Data Privacy

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2009